Descriptional complexity of unambiguous input-driven pushdown automata
نویسندگان
چکیده
منابع مشابه
Descriptional complexity of unambiguous input-driven pushdown automata
It is known that a nondeterministic input-driven pushdown automaton (IDPDA) (a.k.a. visibly pushdown automaton; a.k.a. nested word automaton) of size n can be transformed to an equvalent deterministic automaton of size 2 2) (B. von Braunmühl, R. Verbeek, “Input-driven languages are recognized in log n space”, FCT 1983), and that this size is necessary in the worst case (R. Alur, P. Madhusudan, ...
متن کاملState Complexity of Operations on Input-Driven Pushdown Automata
The family of deterministic input-driven pushdown automata (IDPDA; a.k.a. visibly pushdown automata, a.k.a. nested word automata) is known to be closed under reversal, concatenation and Kleene star. As shown by Alur and Madhusudan (“Visibly pushdown languages”, STOC 2004), the reversal and the Kleene star of an n-state IDPDA can be represented by an IDPDA with 2 2) states, while concatenation o...
متن کاملInput-Driven Double-Head Pushdown Automata
We introduce and study input-driven deterministic and nondeterministic double-head pushdown automata. A double-head pushdown automaton is a slight generalization of an ordinary pushdown automaton working with two input heads that move in opposite directions on the common input tape. In every step one head is moved and the automaton decides on acceptance if the heads meet. Demanding the automato...
متن کاملComplexity of Input-Driven Pushdown Automata1
In an input-driven pushdown automaton (IDPDA), the current input symbol determines whether the automaton performs a push operation, a pop operation, or does not touch the stack. Inputdriven pushdown automata, also known under alternative names of visibly pushdown automata and of nested word automata, have been intensively studied because of their desirable features: for instance, the model allo...
متن کاملDescriptional Complexity of Pushdown Store Languages
It is well known that the pushdown store language P (M) of a pushdown automaton (PDA) M — i.e., the language consisting of words occurring on the pushdown along accepting computations of M — is a regular language. Here, we design succinct nondeterministic finite automata (NFA) accepting P (M). In detail, an upper bound on the size of an NFA for P (M) is obtained, which is quadratic in the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.11.015